Optimum soft decision decoding with graceful degradation
نویسندگان
چکیده
منابع مشابه
Computational Graceful Degradation for Video Sequence Decoding
The implementation of software based video decoders is an advantageous solution over traditional dedicated hardware real time systems. The main reason of this fact is the possibility of decoding several different video compression standards, at different levels and profiles, by just changing the software while using the same hardware platform, main memory, and interfaces. But, simultaneously gu...
متن کاملSoft-decision Viterbi Decoding with Diversity Combining
Diversity combining methods for convolutional coded and soft-decision Viterbi decoded channels in mobile satellite communication systems are evaluated and it is clarified that the pre-Viterbi-decoding maximal ratio combining shows better performance than other methods in Rician fading channels by computer simulation. A novel practical technique for the maximal ratio combining is proposed, in wh...
متن کاملSpecifying Graceful Degradation
Complex programs are often required to display graceful degradation, reacting adaptively to changes in the environment. Under ideal circumstances, the program's behavior satisfies a set of application-dependent constraints. In the presence of events such as failures, timing anomalies, synchronization conflicts, or security breaches, certain constraints may become difficult or impossible to sati...
متن کامل"Soft-decision" Decoding of Chinese Remainder Codes
Given n relatively prime integers p1 < · · · < pn and an integer k < n, the Chinese Remainder Code, CRTp1,...,pn;k, has as its message space M = {0, . . . , ∏k i=1 pi − 1}, and encodes a message m ∈ M as the vector 〈m1, . . . ,mn〉, where mi = m(mod pi). The soft-decision decoding problem for the Chinese remainder code is given as input a vector of residues ~r = 〈r1, . . . , rn〉, a vector of wei...
متن کاملSoft-decision decoding using punctured codes
Let a -ary linear ( )-code be used over a memoryless channel. We design a soft-decision decoding algorithm that tries to locate a few most probable error patterns on a shorter length [ ]. First, we take cyclically consecutive positions starting from any initial point. Then we cut the subinterval of length into two parts and examine most plausible error patterns on either part. To obtain codewor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1979
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(79)90551-5